Protocol for allocating upstream slots over a link in a point-to-multipoint communication system

ABSTRACT

A system for controlling a contention state for a communication link between a base station controller and customer premises equipment in point-to-multipoint communication. The contention state is controlled using a state machine, which includes a grant pending absent state in which a unicast request slot is maintained open for use by the customer premises equipment. During the grant pending absent state, the customer premises equipment sends no upstream data to the base station controller but can use the unicast request slot to request a data slot for sending upstream data to the base station controller. In the grant pending state, the customer premises equipment preferably uses piggybacking to request grant of a next data slot while sending upstream data to the base station controller.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.15/964,393, filed Apr. 27, 2018, in the name of Subir Varma, titled“Protocol for Allocating Upstream Slots Over a Link in aPoint-to-Multipoint Communication System”; which is a continuation ofU.S. patent application Ser. No. 14/805,051, filed Jul. 21, 2015, in thename of Subir Varma, titled “Protocol for Allocating Upstream Slots Overa Link in a Point-to-Multipoint Communication System”, now U.S. Pat. No.9,961,556; which is a continuation of U.S. patent application Ser. No.14/078,246, filed Nov. 12, 2013, in the name of Subir Varma, titled“Protocol for Allocating Upstream Slots Over a Link in aPoint-to-Multipoint Communication System”, now U.S. Pat. No. 9,154,961;which is a continuation of U.S. patent application Ser. No. 14/059,220,filed Oct. 21, 2013, in the name of Subir Varma, titled “Protocol forAllocating Upstream Slots Over a Link in a Point-to-MultipointCommunication System”, now U.S. Pat. No. 9,125,051; which is acontinuation of U.S. patent application Ser. No. 13/360,334, filed Jan.27, 2012, in the name of Subir Varma, titled “Protocol for AllocatingUpstream Slots Over a Link in a Point-to-Multipoint CommunicationSystem”, now U.S. Pat. No. 8,565,256; which is a continuation of U.S.patent application Ser. No. 11/703,065, filed Feb. 6, 2007, in the nameof Subir Varma, titled “Protocol for Allocating Upstream Slots Over aLink in a Point-to-Multipoint Communication System”, now U.S. Pat. No.8,274,991; which is a continuation of U.S. patent application Ser. No.09/689,243, filed Oct. 11, 2000, in the name of Subir Varma, titled“Protocol for Allocating Upstream Slots Over a Link in aPoint-to-Multipoint Communication System”, now U.S. Pat. No. 7,173,921,all of which are hereby incorporated by reference as if fully set forthherein.

BACKGROUND OF THE INVENTION

A portion of the disclosure of this patent document contains materialwhich is subject to copyright protection. The copyright owner has noobjection to the facsimile reproduction by anyone of the patent documentor the patent disclosure, as it appears in the Patent and TrademarkOffice patent file or records, but otherwise reserves all copyrightrights whatsoever.

FIELD OF THE INVENTION

This invention relates to point-to-multipoint communication; inparticular, the invention relates to control of contention for dataslots by customer premises equipment in a wireless point-to-multipointcommunication system.

DESCRIPTION OF THE RELATED ART

In a point-to-multipoint network, plural customer provided equipment(CPEs) communicate bidirectionally with a base station controller (BSC)in a cell. Several CPEs can share a single channel for communicatingwith the BSC. The CPEs and the BSC use time division duplexing (TDD) tofacilitate the bidirectional aspect of the communication. The CPEs andthe BSC use time division multiple access (TDMA) to facilitate sharingof a channel among plural CPEs.

In TDMA, the BSC grants data slots to the CPEs. Because multiple CPEsshare a limited number of data slots, the CPEs and the BSC mustnegotiate data slot assignments through a process called contention.

In contention, CPEs that have upstream data to send to the BSC firstsend a short request (REQ) message to the BSC. The BSC responds with agrant of a data slot for use by the CPE.

Problems can arise in contention. First, two CPEs might simultaneouslytry to use a single request slot to request data slots. This situationis called collision. When collisions occur, neither CPE's requestmessage successfully reaches the BSC. Second, if many request slots aredefined so as to reduce a number of collisions and so as to facilitaterequests by a large number of CPEs, too much of available bandwidth canbe used up by contention traffic. As a result, data throughput can beunacceptably decreased.

One technique used in the prior art to reduce contention traffic iscalled piggybacking. In piggybacking, a CPE first requests a data slot.When the data slot is granted by the BSC, the CPE sends data packetsupstream. The CPE attaches a size of its current data backlog to aheader for one of the data packets. As a result, whenever the backlog isnon-zero, the BSC knows to grant a data slot to the CPE without the CPEhaving to send a REQ message. Thus, contention traffic is reduced.

Unfortunately, piggybacking is only effective if upstream traffic fromthe CPE is of the bursty type, so that the CPE needs to make only onecontention request per burst. However, some important traffic sourcesare non-bursty. Examples of non-bursty traffic include traffic generatedby online games and voice sources. Even ordinary Internet trafficrunning over TCP becomes non-bursty when a communication link is inheavy traffic. In the presence of non-bursty traffic, the piggybackscheme breaks down, and an excessive number of contention requests aresent upstream.

SUMMARY OF THE INVENTION

In view of the foregoing, further reducing contention traffic isdesirable, especially for non-bursty traffic. The invention addressesthis need by using a new state machine to control a contention state fora communication link between a base station controller and customerpremises equipment in point-to-multipoint communication. According tothe invention, the state machine includes a grant pending absent statein which the customer premises equipment is polled with a unicastrequest slot. During the grant pending absent state, the customerpremises equipment sends no upstream data to the base station controllerbut can use the unicast request slot to request a data slot for sendingupstream data to the base station controller.

By virtue of the grant pending absent state, the customer premisesequipment can request a data slot without entering into contention andgenerating excess contention traffic. After a suitable delay withoutmore data being received to send upstream, the state machine can exitthe grant pending absent state. This delay preferably is long enough forreceipt of new non-bursty data for a communication, for example 50 ms.

The state machine preferably also includes an idle state in which thecustomer premises equipment awaits arrival of data packets to send asupstream data to the base station controller, a deferring state in whichthe customer premises equipment requests grant of a data slot forsending upstream traffic to the base station controller and if necessarydefers contending for the data slot so as to avoid collisions with othercustomer premises equipment, and a grant pending state in which thecustomer premises equipment awaits and receives grant of the data slotfor sending upstream data to the base station controller and sendsupstream data to the base station controller after grant of the dataslot.

In a preferred embodiment of the invention, the customer premisesequipment uses piggybacking to request grant of a next data slot whilesending upstream data to the base station controller. Use ofpiggybacking along with the grant pending absent state has been found todecrease drastically contention traffic.

Preferably, the state machine enters the deferring state upon arrival ofdata packets to send as upstream data to the base station controller. Inthe preferred embodiment, the state machine enters the grant pendingstate after the deferring state, returns to the deferring state if acollision occurs, and remains in the grant pending state when sendingupstream data to the base station controller with piggybacking. Thestate machine preferably enters the grant pending absent state after thecustomer premises equipment has sent upstream data to the base stationcontroller in the grant pending state.

The state machine according to the invention preferably also includes anunsolicited grant pending state in which the customer premises equipmentreceives grant of the data slot for sending upstream data to the basestation controller and sends upstream data to the base stationcontroller after grant of the data slot, without having requested thedata slot. The state machine preferably further includes an unsolicitedgrant pending absent state in which the customer premises equipment ispolled with the unicast request slot. During the unsolicited grantpending absent state, the customer premises equipment sends no upstreamdata to the base station controller but can use the unicast request slotto request the data slot for sending upstream data to the base stationcontroller. Preferably, the state machine enters the unsolicited grantpending absent state after the customer premises equipment has sentupstream data to the base station controller in the unsolicited grantpending state.

The invention can be embodied in a method for controlling communicationusing the state machine described above, as well as in software and/orhardware such as a base station controller and/or customer premisesequipment that implements the method, and in various other embodiments.

This brief summary has been provided so that the nature of the inventionmay be understood quickly. A more complete understanding of theinvention may be obtained by reference to the following description ofthe preferred embodiments thereof in connection with the attacheddrawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a block diagram of a wireless communication system accordingto the invention in which a base station controller communicates withone or more customer premises equipment according to the invention.

FIG. 2 is a flow chart of a state machine according to the invention.

DESCRIPTION OF THE PREFERRED EMBODIMENT Related Applications

Inventions described herein can be used in conjunction with inventionsdescribed in the following documents. [0023] U.S. patent applicationSer. No. 09/475,642, Express Mail Mailing No. EL524780018US, filed Dec.30, 1999 in the names of Reza Majidi-Ahy, Subir Varma, Khuong Ngo, JeanFuentes and Paul Trong, attorney docket number 164.1002.01, titled“Adaptive Link Layer for Point to Multipoint Communication System.”[0024] U.S. patent application Ser. No. 09/475,716, Express Mail MailingNo. EL524780021US, filed Dec. 30, 1999 in the names of Reza Majidi-Ahy,Joseph Hakim, and Subir Varma, attorney docket number 164.1003.01,titled “Integrated Self-Optimizing Multi-Parameter and Multi-VariablePoint to Multipoint Communication System.” [0025] U.S. patentapplication Ser. No. 09/540,674, Express Mail Mailing No. EL524781512US,filed Mar. 31, 2000, in the name of Reza Majidi-Ahy, attorney docketnumber 164.1001.01, titled “Robust Topology Wireless Communication UsingBroadband Access Points.” [0026] U.S. patent application Ser. No.09/604,784, Express Mail Mailing No. EL524781225US, filed Jun. 26, 2000in the name of Reza Majidi-Ahy, attorney docket number 164.1010.01,titled “High-Capacity Scalable Integrated Wireless Backhaul forBroadband Access Networks.” and [0027] U.S. patent application Ser. No.09/475,716, Express Mail Mailing No. EL524780021 US, filed Dec. 30, 1999in the names of Reza Majidi-Ahy, Joseph Hakim, and Subir Varma, attorneydocket number 164.1003.01, titled “Integrated, Self-Optimizing,Multi-Parameter/Multi-Variable Point-to-Multipoint Communication System[II].”

Each of these documents is hereby incorporated by reference as if fullyset forth herein. This application claims priority of each of thesedocuments. These documents are collectively referred to as the“Incorporated Disclosures.”

Lexicography

The following terms refer or relate to aspects of the invention asdescribed below. The descriptions of general meanings of these terms areintended to be illustrative, not limiting.

base station controller (BSC)—in general, a device for performingcoordination and control for a wireless communication cell. There is noparticular requirement that the base station controller must be a singledevice; in alternative embodiments, the base station controller caninclude a portion of a single device, a combination of multiple devices,or some hybrid thereof.

communication link—in general, an element for sending information from asender to a recipient. Although in a preferred embodiment thecommunication links referred to are generally wireless line of sightpoint to point communication links, there is no particular requirementthat they are so restricted.

customer premises equipment (CPE)—in general, a device for performingcommunication processes and tasks at a customer location, and operatingin conjunction with the base station controller within a wirelesscommunication cell. There is no particular requirement that the customerpremises equipment must be a single device; in alternative embodiments,the customer premises equipment can include a portion of a singledevice, a combination of multiple devices, or some hybrid thereof.

As noted above, these descriptions of general meanings of these termsare not intended to be limiting, only illustrative. Other and furtherapplications of the invention, including extensions of these terms andconcepts, would be clear to those of ordinary skill in the art afterperusing this application. These other and further applications are partof the scope and spirit of the invention, and would be clear to those ofordinary skill in the art, without further invention or undueexperimentation.

System Context

The context of the invention is similar to that of the IncorporatedDisclosures.

A system using point-to-multipoint communication in a wirelesscommunication system operates as part of a system in which devicescoupled to a network (such as a computer network) send messages, routeand switch messages, and receive messages. In a preferred embodiment,devices coupled to (and integrated with) the network send, route, andreceive these messages as sequences of packets, each of which has aheader including delivery information and a payload including data. In apreferred embodiment, packet format conforms to the OSI model, in whichan application protocol (layer 5, such as FTP) uses a transport protocol(layer 4, such as TCP), which uses a network protocol (layer 3, such asIP), which uses a media access control (MAC) protocol (layer 2), whichuses a physical transport technique (layer 1).

System Elements

FIG. 1 is a block diagram of a wireless communication system accordingto the invention in which a base station controller communicates withone or more customer premises equipment according to the invention.

System 10 includes wireless communication cell 11 (or a portionthereof), base station controller (BSC) 12, and one or more customerpremises equipment (CPE) 13.

Wireless communication cell 11 preferably includes a generallyhexagon-shaped region of local surface area, such as might be found in ametropolitan region. Use of generally hexagon-shaped regions is known inthe art of wireless communication because hexagonal regions are able totile a local region with substantially no gaps. Although in a preferredembodiment wireless communication cell 11 includes a generallyhexagon-shaped region, no particular requirement exists for using thatparticular shape; in alternative embodiments, another shape or tiling ofthe local surface area may be useful.

In FIG. 1, a portion of cell 11 includes a generally triangular-shapedregion of local surface area, herein called a “sector.” Sectors 14preferably are disposed so that a set of six sectors 14 combine to formsingle cell 11. Thus, BSC 12 preferably is disposed at or near onecorner of one of sectors 14, while CPEs 13 are disposed within thesectors.

Although the invention is primarily described with regard tointeractions that occur between BSC 12 and a single CPE 13 in a singlesector 14, substantial applications of the invention exist forinteractions across multiple sectors within a cell, and to interactionacross sectors in multiple cells. Substantial applications of theinvention with regard to multiple sectors, both within single cell andamong multiple cells, would be clear to those skilled in the art ofwireless communication after perusal of this application, and would notrequire undue experimentation or further invention.

BSC 12 preferably includes a processor, program and data memory, massstorage, and one or more antennas for sending or receiving informationusing wireless communication techniques.

Similar to BSC 12, each CPE 13 preferably includes a processor, programand data memory, mass storage, and one or more antennas for sending orreceiving information using wireless communication techniques.

In system 10, plural CPEs 13 communicate bidirectionally with BSC 12.Several CPEs 13 can share a single channel for communicating with BSC12. BSC 12 and CPEs 13 preferably use time division duplexing (TDD) tofacilitate the bidirectional aspect of the communication. BSC 12 andCPEs 13 preferably use time division multiple access (TDMA) tofacilitate sharing of a channel among plural CPEs 13.

In TDMA, BSC 12 grants data slots to CPEs 13. Because multiple CPEs 13share a limited number of data slots, CPEs 13 and BSC 12 must negotiatedata slot assignments through a process called contention.

In contention, CPEs 13 that have upstream data to send to BSC 12 firstsend a short request (REQ) message to BSC 12. The BSC responds with agrant of a data slot for use by the CPE.

Problems can arise in contention. Plural CPEs 13 might simultaneouslytry to use a single request slot to request data slots. This situationis called collision. When collisions occur, none of the CPE's requestmessages successfully reach BSC 12. Those CPEs 13 have to re-send theirREQ messages. In order to try to allow REQ traffic to clear, CPEs 13according to the invention can defer re-sending REQ messages for someperiod of time when collisions occur.

If many request slots are defined so as to reduce a number of collisionsand so as to facilitate requests by a large number of CPEs 13, or if toomany REQ messages have to be re-sent, too much of available bandwidthcan be used up by contention traffic. As a result, data throughput canbe unacceptably decreased.

One technique used in the prior art to reduce contention traffic iscalled piggybacking. In piggybacking, CPE 13 first requests a data slot.When the data slot is granted by BSC 12, CPE 13 sends data packetsupstream. CPE 13 attaches a size of its current data backlog to a headerfor one of the data packets. As a result, whenever the backlog isnon-zero, BSC 12 knows to grant a data slot to CPE 13 without CPE 13having to send a REQ message. Thus, contention traffic is reduced.

Unfortunately, piggybacking is only effective if upstream traffic fromCPE 13 is of the bursty type, so that CPE 13 needs to make only onecontention request per burst. However, some important traffic sourcesare non-bursty. Examples of non-bursty traffic include traffic generatedby online games and voice sources. Even ordinary Internet trafficrunning over TCP becomes non-bursty when a communication link is inheavy traffic. In the presence of non-bursty traffic, the piggybackscheme breaks down, and an excessive number of contention requests aresent upstream.

The invention attempts to reduce contention traffic by using a new statemachine to control a contention state for a communication link between abase station controller and customer premises equipment inpoint-to-multipoint communication. The state can be controlled by theCPE, the BSC, or both.

FIG. 2 is a flow chart of a state machine according to the invention.

Briefly, according to the invention, the state machine includes a grantpending absent state in which the customer premises equipment is polledwith a unicast request slot. During the grant pending absent state, thecustomer premises equipment sends no upstream data to the base stationcontroller but can use the unicast request slot to request a data slotfor sending upstream data to the base station controller.

By virtue of the grant pending absent state, the customer premisesequipment can request a data slot without entering into contention andgenerating excess contention traffic. After a suitable delay withoutmore data being received to send upstream, the state machine can exitthe grant pending absent state. This delay preferably is long enough forreceipt of new non-bursty data for a communication, for example 50 ms.

In more detail, FIG. 2 shows a state machine that includes idle state20, deferring state 21, grant pending state 22, grant pending absentstate 23, unsolicited grant pending state 24, and unsolicited grantpending absent state 25. While the particular states shown in FIG. 2 arerepresentative of a preferred embodiment of the invention, the inventionalso can utilize state machines that do not include all of these statesand/or that include additional states.

Idle state 20 is a waiting state in which the customer premisesequipment awaits arrival of data packets to send as upstream data to thebase station controller.

Upon arrival of data to be sent as upstream data, the state machinetransitions to deferring state 21. The state machine also can transitionto unsolicited grant pending state 24 upon receipt of an unsolicitedgrant of a data slot from BSC 24, as discussed below.

In deferring state 21, CPE 13 sends a REQ message to BSC 12. The statemachine then transitions to grant pending state 22. However, if no grantis received from BSC 12 in grant pending state 22 before a timeout, thestate machine returns to deferring state 21, as discussed below.

One possible reason for non-receipt of a grant is a collision withanother CPE 13. Thus, deferral is needed, and CPE 13 defers sending anew REQ message for a period of time. The CPE then sends the new REQmessage. In a preferred embodiment, if another collision occurs, CPE 13again defers sending another REQ message. This process preferablycontinues until the REQ messages gets through to BSC 12 (as evidenced byreceipt of a grant) or until an error is generated (not shown).

Preferably, each time CPE 13 defers sending a REQ message, the period ofdeferral roughly doubles, with a random factor included to try to avoiddeferring in synch with another CPE. Thus, in deferring state 21, CPE 13defers contending for a data slot so as to avoid collisions with othercustomer premises equipment.

In grant pending state 22, CPE 13 awaits and receives grant of the dataslot for sending upstream data to the base station controller and sendsupstream data to the base station controller after grant of the dataslot. However, if a grant is not received before a timeout, the CPEconcludes that a collision or some other error has occurred, and thestate machine returns to deferring state 21.

Preferably, in grant pending state 22, CPE 13 uses piggybacking torequest grant of a next data slot while sending upstream data to BSC 12.When CPE 13 sends the last data in its backlog, that data preferably issent without piggybacking. The state machine then transitions to grantpending absent state 23 according to the invention.

During grant pending absent state 23, CPE 13 sends no upstream data toBSC 12. No grant is pending because piggybacking was not used in theprevious transmission of data to BSC 12 (hence the name of the state).Rather, CPE 13 is periodically (e.g., every 10 ms) polled by BSC 12 witha unicast request slot. CPE 13 can use this unicast request slot torequest a data slot for sending upstream data to the base stationcontroller. Thus, if more data is received by is CPE 13 to send upstreamto BSC 12, CPE 13 can request a data slot without going throughcontention, thereby reducing contention traffic.

In some circumstances, the reduction in contention traffic can bedrastic, for example by an order of magnitude. Of course, the inventionis not limited to such circumstances and is not limited to such drasticreductions in contention traffic.

Upon grant of a data slot for sending new data to BSC 12, CPE 13 returnsto grant pending state 22.

If no new data is received by CPE 13 before a timeout in grant pendingabsent state 23, the state machine returns to idle state 20. A timeoutof 50 ms has been found to work well.

In some circumstances, BSC 12 can grant a data slot to CPE 13 withoutthe CPE having requested the data slot. For example, if thecommunication between BSC 12 and CPE 13 is a voice communication, BSC 12can predict that CPE 13 will need data slots. BSC 12 can grant thosedata slots to CPE 13 without CPE 13 having to request them. Such a grantis an unsolicited grant.

Accordingly, the preferred embodiment of the state machine according tothe invention also includes unsolicited grant pending state 24 andunsolicited grant pending absent state 25. These states correspond togrant pending state 22 and grant pending absent state 23, respectively,with the exception that they are entered when an unsolicited grantoccurs.

Thus, in unsolicited grant pending state 24, CPE 13 receives grant ofthe data slot for sending upstream data to the base station controllerand sends upstream data to the base station controller after grant ofthe data slot, without having requested the data slot.

In unsolicited grant pending absent state 25, CPE 13 is polled with theunicast request slot. During unsolicited grant pending absent state 25,CPE 13 sends no upstream data to BSC 12 but can use the unicast requestslot to request the data slot for sending upstream data to BSC 12. Thestate machine enters unsolicited grant pending absent state 25 after CPE12 has sent upstream data to BSC 12 in unsolicited grant pending state24.

Pseudo-code for implementing the preferred embodiment of the inventionsubstantially as discussed above is included in a technical appendix tothis application.

Alternative Embodiments

The invention can be embodied in a method for controlling communicationusing the state machine described above, as well as in software and/orhardware such as a BSC and/or a CPE that implements the method, and invarious other embodiments.

In the preceding description, a preferred embodiment of the invention isdescribed with regard to preferred process steps and data structures.However, those skilled in the art would recognize, after perusal of thisapplication, that embodiments of the invention may be implemented usingone or more general purpose processors or special purpose processorsadapted to particular process steps and data structures operating underprogram control, that such process steps and data structures can beembodied as information stored in or transmitted to and from memories(e.g., fixed memories such as DRAMs, SRAMs, hard disks, caches, etc.,and removable memories such as floppy disks, CD-ROMs, data tapes, etc.)including instructions executable by such processors (e.g., object codethat is directly executable, source code that is executable aftercompilation, code that is executable through interpretation, etc.), andthat implementation of the preferred process steps and data structuresdescribed herein using such equipment would not require undueexperimentation or further invention.

Furthermore, although preferred embodiments of the invention aredisclosed herein, many variations are possible which remain within thecontent, scope and spirit of the invention, and these variations wouldbecome clear to those skilled in the art after perusal of thisapplication.

TECHNICAL APPENDIX Pseudo-code copyright 2000 Aperto Networks, Inc. 4.1State: Idle TABLE-US-00001 ContentionWindow = 0; Wait for !QueueEmpty;/* The CPE may get an unicast REQ slot in the idle state. */ /* In thiscase it returns the current reqWin value */ if (unicast REQ SID ==mySID) /* Polling case */ { Transmit REQ in reservation; Tx_slot = slot;PrevREQ = NonContREQ; } if (NormalGrantId == mySID) Utilize NormalGrant( ); else if (UnsolicitedGrantId == mySID) { Utilize UnsolicitedGrant( ); Go to State Unsolicited Grant Pending; } /* EPDU Arrives */Enqueue( ); CalculateDefer( ); Go to State Deferring 4.2 State:Deferring TABLE-US-00002 if (UnsolicitedGrantId == mySID) /* UnsolicitedGrant Service */ { Utilize Unsolicited Grant( ); Go to State UnsolicitedGrant Pending; } else if (NormalGrantId == mySID) Utilize Normal Grant(); else if (unicast REQ SID == mySID) /* Polling case */ { Transmit REQin reservation; Tx_slot = slot; Go to Grant Pending; PrevREQ =NonContREQ; } else { for (REQ Transmit Opportunity) /* Contention basedREQ transmission */ { if (Defer != 0) Defer = Defer − 1; else /* Defer =0 */ { if (Number of SIDs in CPE, with Defer = 0 is greater than 1)choose one SID at random; if (my SID chosen) { Transmit REQ incontention; Tx_slot = slot; RTxTime = time_now; PrevREQ = ContREQ; Go toGrant Pending; } } } } .3 State: Grant Pending TABLE-US-00003 Wait fornext MAP; Move ACK pointer as per ACK field in MAP; The next byte totransmit is set as per ACK/NACK flag and Sequence Number in the ACK if(Flush EPDU field set) { Flush HOL EPDU; Go to Idle; } if (unicast REQSID == mySID) /* Polling case */ { Transmit REQ in reservation; Tx_slot= slot; PrevREQ = NonContREQ; } if (Normal GrantId == mySID) UtilizeNormal Grant( ); else if (Unsolicited GrantId == mySID) { UtilizeUnsolicited Grant( ); Go to State Unsolicited Grant Pending; } else if(implicit collision indication received) Retry( ); else /* ErrorCondition: BSC did not give grant that CPE is expecting */ Go to Idle;4.4 State: Grant Pending Absent TABLE-US-00004 if (First Time EnteringState) Count = GrantPendingWait; else --Count; if (unicast REQ SID ==mySID) /* Polling case */ { Transmit REQ in reservation; Tx_slot = slot;PrevREQ = NonContREQ; } 4.5 State: Unsolicited Grant PendingTABLE-US-00005 if (unicast REQ SID == mySID) /* Polling case */ {Transmit REQ in reservation; Tx_slot = slot; PrevREQ = NonContREQ; } if(Unsolicited GrantId == mySID) { Utilize Unsolicited Grant( ); Remain inState Unsolicited Grant Pending; } if (Last Unsolicited Grant) Go tostate Idle; 4.6 State: Unsolicited Grant Absent TABLE-US-00006 if (FirstTime Entering State) Count = UnsolicitedGrantPendingWait; else --Count;if (unicast REQ SID == mySID) /* Polling case */ { Transmit REQ inreservation; Tx_slot = slot; PrevREQ = NonContREQ; } 4.7 Function:CalculateDefer( ) TABLE-US-00007 if (ContentionWindow < Start) Window =Start; if (ContentionWindow > End) Window = End; Defer =Random[2{circumflex over ( )}ContentionWindow]; 4.8 Function: UtilizeNormal Grant( ) TABLE-US-00008 if (Grant Size == 0) /* Scheduler notable to make grant during this frame */ Go to Grant Pending; else /*Grant Size > 0 */ { while (GrantSID == mySID) /* Multiple Grants in MAP*/ { Extract Indicated number of bytes from SID queue; Confirm thatthese bytes fit in the tick space allocated; piggyback size =RequestWindow; Transmit WPDU with Sequence Number Field set as per MAPand Piggyback field set as above; } if (piggyback size > 0) { Go toGrant Pending; RTxTime = time_now; PrevREQ = NonCOntREQ; } else /* Nomore bytes left in SID queue */ Go to GrantPendingWait; } 4.9 Function:Utilize Unsolicited Grant( ) TABLE-US-00009 while (GrantSID == mySID) /*Multiple Grants in MAP */ { Extract Indicated number of bytes from SIDqueue; if (#bytes == 0) Tx only WPDU header; else { Confirm that thesebytes fit in the tick space allocated; piggyback size = RequestWindow;Transmit WPDU with Sequence Number Field set as per MAC and Piggybackfield set as above; } } 4.10 Function: Retry( ) TABLE-US-00010 Retries =Retries + 1; if (Retries > 16) { Discard HOL EPDU; Go to Idle; }ContentionWindow = ContentionWindow + 1; CalcDefer( ); Go to Deferring;4.11 Function: Enqueue( ) Enqueue EPDU to tail of queue;RequestWindow=RequestWIndow+Size of EPDU.

We claim:
 1. A customer premises equipment (CPE), comprising: aprocessor; an antenna operable to send information using wirelesscommunication techniques in a point-to-multipoint communication system,the CPE operable to communicate with a base station controller (BSC)over a communication link shared with other CPEs; and a memorycomprising instructions, the instructions executable by the processorto: transition from a grant pending state to a grant pending absentstate once the CPE has transmitted upstream data to the BSC within abandwidth specified by a bandwidth grant received from the BSC duringthe grant pending state and the CPE has no pending bandwidth requests;operate the CPE in the grant pending absent state wherein the CPE awaitsarrival of data for transmission to the BSC and transmits, via theantenna, a non-contention bandwidth request to the BSC when the CPEreceives data for transmission; transition operation of the CPE from thegrant pending absent state to the grant pending state subsequent to andin consequence of a subsequent bandwidth grant received at the CPE; andtransition operation of the CPE from the grant pending absent state toan idle state if the CPE does not transmit any non-contention bandwidthrequest to the BSC during a timeout period.